By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Search This Issue
Volume 20, Issue 6, pp. 999-1189

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

CREW PRAMs and Decision Trees

Noam Nisan

pp. 999-1007

BibTeX  Abstract Full Text:  PDF

On the Exact Complexity of String Matching: Lower Bounds

Zvi Galil and Raffaele Giancarlo

pp. 1008-1020

BibTeX  Abstract Full Text:  PDF

Self-P-Printability and Polynomial Time Turing Equivalence to a Tally Set

Roy S. Subinstein

pp. 1021-1033

BibTeX  Abstract Full Text:  PDF

New Upper Bounds in Klee's Measure Problem

Hillel Gazit

pp. 1034-1045

BibTeX  Abstract Full Text:  PDF

An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph

Hillel Gazit

pp. 1046-1067

BibTeX  Abstract Full Text:  PDF

Asymptotically Fast Triangularization of Matrices over Rings

James L. Hafner and Kevin S. McCurley

pp. 1068-1083

BibTeX  Abstract Full Text:  PDF

Noninteractive Zero-Knowledge

Manuel Blum, Alfredo De Santis, Silvio Micali, and Giuseppe Persiano

pp. 1084-1118

BibTeX  Abstract Full Text:  PDF

Elimination of Infrequent Variables Improves Average Case Performance of Satisfiability Algorithms

John Franco

pp. 1119-1127

BibTeX  Abstract Full Text:  PDF

Parallel Tree Contraction Part 2: Further Applications

Gary L. Miller and John H. Reif

pp. 1128-1147

BibTeX  Abstract Full Text:  PDF

On Sets with Efficient Implicit Membership Tests

Lane A. Hemachandra and Albrecht Hoene

pp. 1148-1156

BibTeX  Abstract Full Text:  PDF

An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem

Zvi Galil and Oded Margalit

pp. 1157-1189

BibTeX  Abstract Full Text:  PDF